ETER: Encounter Time Estimating Routing for Satellite IP Networks

نویسندگان

  • Yu Zhang
  • Feng Liu
چکیده

Satellites in Satellite IP network (SIPN) run along its orbit and have fixed periods. It is possible to estimate the encounter time between two satellites using their history encountering information. We introduce a method to estimate the time. Based on the encounter time information estimated, a new routing method, named Encounter Time Estimating Routing (ETER), is presented in the paper. ETER firstly estimates the encounter time among satellites. Secondly, it forms a graph, assign values of encounter time as the weight of edges. Then ETER path algorithm, a modified Dijkstra algorithm, finds the best routing set for packets. Finally, ETER forward each packet using ETER forwarding algorithm. The simulation result shows that ETER has better performance on packet loss rate and transferring throughput under all traffic loads; under lower traffic loads, the average end-to-end delays of ETER is a little higher than Epidemic routing, but lower than PKR; under higher traffic loads, the delays is lower than PKR and close to Epidemic routing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IP routing issues in satellite constellation networks

The growth in use of Internet-based applications in recent years has led to telecommunication networks transporting an increasingly large amount of Internet Protocol (IP)-based traffic. Proposed broadband satellite constellation networks, currently under development, will be required to transport IP traffic. A case can be made for implementing IP routing directly within the constellation networ...

متن کامل

Simple Change Adaptive Routing Algorithm for Satellite IP Networks

although the LEO constellation has dynamic satellite network topology, the topology changes are predictable and periodic. Based on the characteristics above, a new simple change adaptive routing algorithm (SCARA) is proposed for satellite IP networks. SCARA uses simple rules to decide the next hop. The rules are 1) using only two possible directions to reduce the routing path; 2) assigning high...

متن کامل

Simple Change Adaptive Routing Algorithm for Satellite IP Networks

although the LEO constellation has dynamic satellite network topology, the topology changes are predictable and periodic. Based on the characteristics above, a new simple change adaptive routing algorithm (SCARA) is proposed for satellite IP networks. SCARA uses simple rules to decide the next hop. The rules are 1) using only two possible directions to reduce the routing path; 2) assigning high...

متن کامل

VoIP PERFORMANCE IN NGEO SATELLITE IP NETWORKS WITH ON-BOARD PROCESSING CAPABILITY

VoIP PERFORMANCE IN NGEO SATELLITE IP NETWORKS WITH ON-BOARD PROCESSING CAPABILITY In this thesis study, an adaptive routing policy utilizing the real-time network information of a two-layered satellite network is introduced. In a satellite network, depending on the requirements and properties of services provided, various kinds of satellites from different orbits can be employed. Geostationary...

متن کامل

A Routing Protocol for Hierarchical LEO/MEO Satellite IP Networks

The rapid growth of Internet-based applications pushes broadband satellite networks to carry on IP traffic. In previously proposed connectionless routing schemes in satellite networks, the metrics used to calculate the paths do not reflect the total delay a packet may experience. In this paper, a new Satellite Grouping and Routing Protocol (SGRP) is developed. In each snapshot period, SGRP divi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2014